Resolution-Based Certificate Extraction for QBF - (Tool Presentation)
نویسندگان
چکیده
A certificate of (un)satisfiability for a quantified Boolean formula (QBF) represents concrete assignments to the variables, which act as witnesses for its truth value. Certificates are highly requested for practical applications of QBF like formal verification and model checking. We present an integrated set of tools realizing resolution-based certificate extraction for QBF in prenex conjunctive normal form. Starting from resolution proofs produced by the solver DepQBF, we describe the workflow consisting of proof checking, certificate extraction, and certificate checking. We implemented the steps of that workflow in stand-alone tools and carried out comprehensive experiments. Our results demonstrate the practical applicability of resolution-based certificate extraction.
منابع مشابه
Extracting and Validating Skolem/Herbrand Function-Based QBF Certificates
Quantified Boolean Formulas (QBF) allow succinct representations of many real-world problems, e.g., in formal verification, artificial intelligence, or computer-aided design of integrated circuits. Hence, for many practical instances of QBF efficient decision procedures are highly requested. However, in many applications of QBF, it is not sufficient to ”just” solve problems but necessary to pro...
متن کاملExtracting and Checking Q-Resolution Proofs from a State-Of-The-Art QBF-Solver
The logic of Quantified Boolean Formulas (QBF) is an extension of propositional logic and provides compact encodings of real world problems in various fields of application, e.g., formal verification, reasoning and artificial intelligence. In recent years, the development of efficient decision procedures for QBF has progressed considerably. However, most current state-of-the-art QBF-solvers ret...
متن کاملQBF Resolution Systems and Their Proof Complexities
Quantified Boolean formula (QBF) evaluation has a broad range of applications in computer science and is gaining increasing attention. Recent progress has shown that for a certain family of formulas, Qresolution, which forms the foundation of learning in modern search-based QBF solvers, is exponentially inferior in proof size to two of its extensions: Q-resolution with resolution over universal...
متن کاملUnified QBF certification and its applications
Quantified Boolean formulae (QBF) allow compact encoding of many decision problems. Their importance motivated the development of fast QBF solvers. Certifying the results of a QBF solver not only ensures correctness, but also enables certain synthesis and verification tasks. To date the certificate of a true formula can be in the form of either a syntactic cube-resolution proof or a semantic Sk...
متن کاملLong-Distance Resolution: Proof Generation and Strategy Extraction in Search-Based QBF Solving
Strategies (and certificates) for quantified Boolean formulas (QBFs) are of high practical relevance as they facilitate the verification of results returned by QBF solvers and the generation of solutions to problems formulated as QBFs. State of the art approaches to obtain strategies require traversing a Q-resolution proof of a QBF, which for many real-life instances is too large to handle. In ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012